Predicting The Performance of Minimax and Product in Game-Tree

نویسندگان

  • Ping-Chung Chi
  • Dana S. Nau
چکیده

The discovery that the minimax decision rule performs poorly in some games has sparked interest in possible alternatives to minimax. Until recently, the only games in which minimax was known to perform poorly were games which were mainly of theoretical interest. However, this paper reports results showing poor performance of minimax in a more common game called kalah. For the kalah games tested, a non-minimax decision rule called the product rule performs significantly better than minimax. This paper also discusses a possible way to predict whether or not minimax will perform well in a game when compared to product. A parameter called the rate of heuristic flaw (rhf) has been found to correlate positively with the. performance of product against minimax. Both analyti­ cal and experimental results are given that appear to support the predictive power of rhf.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Predicting the Performance of Minimax and Product in Game-Tree Searching'

The discovery t ha t the minimax decision rule performs poorly in some games has sparked interest in possible al ternatives to minimax. Until recently, the only games in which minimax was known to perform poorly were games which were mainly of theoretical interest. However, this paper reports results showing poor performance of minimax in a more common game called kalah. For the kalah games tes...

متن کامل

Comparing Minimax and Product in a Variety

This paper describes comparisons of the minimax backup rule and the product back-up rule on a wide variety of games, including P-games, G-games, three-hole kalah, Othello, and Ballard’s incremental game. In three-hole kalah, the product rule plays better than a minimax search to the same depth. This is a remarkable result, since it is the first widely known game in which product has been found ...

متن کامل

COMPARISON OF THE MINIMAX AND PRODUcT BACK-UP RULES IN A VARIETY OF GAMES!

This paper describes comparisons of the minimax back-up rule and the product back-up rule on a wide variety of games, including Pgames, G-games, three-hole kalah, othello, and Ballard's incremental game. In three-hole kalah, the product rule plays better than a minimax search to the same depth. This is a remarkable result, since it is the first widely known game in which product has been found ...

متن کامل

A Theory of Game Tree$

A theory of heuristic game tree search and evaluation functions for estimating minimax values is developed. The result is quite different from the traditional minimsx approach to game playing, and it leads to product-propagation rules for backing up values when subpositions in the game are independent. In this theory Nau’s paradox is avoided and deeper searching leads to better moves if one has...

متن کامل

Improving Local Decisions in Adversarial Search

Until recently, game-tree pathology (in which a deeper game-tree search results in worse play) has been thought to be quite rare. We provide an analysis that shows that every game should have some sections that are locally pathological, assuming that both players can potentially win the game. We also modify the minimax algorithm to recognize local pathologies in arbitrary games, and cut off sea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1304.3081  شماره 

صفحات  -

تاریخ انتشار 2011